Local-edge-connectivity in digraphs and oriented graphsVOLKMANN, Lutz.Discrete mathematics. 2007, Vol 307, Num 24, pp 3207-3212, issn 0012-365X, 6 p.Article

Cycles in folded hypercubesXU, Jun-Ming; MEIJIE MA.Applied mathematics letters. 2006, Vol 19, Num 2, pp 140-145, issn 0893-9659, 6 p.Article

Hamiltonicity of 2-connected {K_1,4, K_1,4 + e}-free graphsRAO LI.Discrete mathematics. 2004, Vol 287, Num 1-3, pp 69-76, issn 0012-365X, 8 p.Article

On the Hamilton connectivity of generalized Petersen graphs : Hamiltonicity problem for vertex-transitive (Cayley) graphsALSPACH, Brian; JIPING LIU.Discrete mathematics. 2009, Vol 309, Num 17, pp 5461-5473, issn 0012-365X, 13 p.Article

How to contract an essentially 6-connected graph to a 5-connected graphKRIESELL, Matthias.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 494-510, issn 0012-365X, 17 p.Article

Trivially noncontractible edges in a contraction critically 5-connected graphANDO, Kiyoshi.Discrete mathematics. 2005, Vol 293, Num 1-3, pp 61-72, issn 0012-365X, 12 p.Conference Paper

Adjacency Method for Finding Connected Subsets of a Graph : An Application of Graph Theory to Spatial StatisticsJUN LUO; LAN HUANG; HACHEY, Mark et al.Communications in statistics. Simulation and computation. 2009, Vol 38, Num 3-5, pp 1136-1151, issn 0361-0918, 16 p.Article

Asymptotic connectivity of hyperbolic planar graphsBAHLS, Patrick; DIPASQUALE, Michael R.Discrete mathematics. 2010, Vol 310, Num 24, pp 3462-3472, issn 0012-365X, 11 p.Article

On the maximum and minimum Zagreb indices of graphs with connectivity at most kSHUCHAO LI; HAIBING ZHOU.Applied mathematics letters. 2010, Vol 23, Num 2, pp 128-132, issn 0893-9659, 5 p.Article

Connectivity of the Mycielskian of a graphBALAKRISHNAN, R; FRANCIS RAJ, S.Discrete mathematics. 2008, Vol 308, Num 12, pp 2607-2610, issn 0012-365X, 4 p.Article

Contractible edges in minimally k-connected graphsANDO, Kiyoshi; KANEKO, Atsushi; KAWARABAYASHI, Ken-Ichi et al.Discrete mathematics. 2008, Vol 308, Num 4, pp 597-602, issn 0012-365X, 6 p.Article

The super laceability of the hypercubesCHANG, Chung-Haw; LIN, Cheng-Kuan; HUANG, Hua-Min et al.Information processing letters. 2004, Vol 92, Num 1, pp 15-21, issn 0020-0190, 7 p.Article

On the λ'-optimality in graphs with odd girth g and even girth hBALBUENA, C; GARCIA-VAZQUEZ, P; MONTEJANO, L. P et al.Applied mathematics letters. 2011, Vol 24, Num 7, pp 1041-1045, issn 0893-9659, 5 p.Article

Tenacity of a graph with maximum connectivityMOAZZAMI, Dara.Discrete applied mathematics. 2011, Vol 159, Num 5, pp 367-380, issn 0166-218X, 14 p.Article

Edge-connectivity of regular graphs with two orbitsFENGXIA LIU; JIXIANG MENG.Discrete mathematics. 2008, Vol 308, Num 16, pp 3711-3716, issn 0012-365X, 6 p.Article

Edge neighbor connectivity of Cartesian product graph G x K₂XUEBIN ZHAO; ZHAO ZHANG; QIN REN et al.Applied mathematics and computation. 2011, Vol 217, Num 12, pp 5508-5511, issn 0096-3003, 4 p.Article

Some inequalities for the atom-bond connectivity index of graph operationsFATH-TABAR, G. H; VAEZ-ZADEH, B; ASHRAFI, A. R et al.Discrete applied mathematics. 2011, Vol 159, Num 13, pp 1323-1330, issn 0166-218X, 8 p.Article

The spanning connectivity of line graphsHUANG, Po-Yi; HSU, Lih-Hsing.Applied mathematics letters. 2011, Vol 24, Num 9, pp 1614-1617, issn 0893-9659, 4 p.Article

On the general sum-connectivity index of treesZHIBIN DU; BO ZHOU; TRINAJSTIC, Nenad et al.Applied mathematics letters. 2011, Vol 24, Num 3, pp 402-405, issn 0893-9659, 4 p.Article

The least eigenvalue of graphs with given connectivityYE, Miao-Lin; FAN, Yi-Zheng; DONG LIANG et al.Linear algebra and its applications. 2009, Vol 430, Num 4, pp 1375-1379, issn 0024-3795, 5 p.Article

On minimum degree implying that a graph is H-linkedGOULD, Ronald J; KOSTOCHKA, Alexandr; GEXIN YU et al.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 4, pp 829-840, issn 0895-4801, 12 p.Article

Vertex-oblique graphsSCHREYER, Jens; WALTHER, Hansjoachim; MEL'NIKOV, Leonid S et al.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1538-1544, issn 0012-365X, 7 p.Conference Paper

Labeling schemes for flow and connectivityKATZ, Michal; KATZ, Nir A; KORMAN, Amos et al.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 23-40, issn 0097-5397, 18 p.Article

Bandwidth of the corona of two graphsKOJIMA, Toru.Discrete mathematics. 2008, Vol 308, Num 17, pp 3770-3781, issn 0012-365X, 12 p.Article

Degree sum and connectivity conditions for dominating cyclesYAMASHITA, Tomoki.Discrete mathematics. 2008, Vol 308, Num 9, pp 1620-1627, issn 0012-365X, 8 p.Article